Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants
نویسندگان
چکیده
We consider the group $(\mathcal{G},*)$ of unitized multiplicative functions in incidence algebra non-crossing partitions, where ``$*$'' denotes convolution operation. introduce a larger $(\widetilde{\mathcal{G}},*)$ from same algebra, which satisfy weaker condition being ``semi-multiplicative''. The natural action $\widetilde{\mathcal{G}}$ on sequences multilinear functionals non-commutative probability space captures combinatorics transitions between moments and some brands cumulants that are studied literature. use framework order to explain why multiplication free random variables can be very nicely described terms Boolean more generally $t$-Boolean cumulants, one-parameter interpolation arising work Bozejko Wysoczanski. It is known $\mathcal{G}$ naturally identified as characters Hopf Sym symmetric functions. show also $\mathcal{T}$, an sense Schmitt. Moreover, inclusion into turns out dual bialgebra homomorphism $\mathcal{T}$ onto Sym.
منابع مشابه
A “Fourier Transform” for Multiplicative Functions on Non-Crossing Partitions
We describe the structure of the group of normalized multiplicative functions on lattices of noncrossing partitions. As an application, we give a combinatorial proof of a theorem of D. Voiculescu concerning the multiplication of free random variables.
متن کاملMultiplicative Partitions
New formulas for the multiplicative partition function are developed. Besides giving a fast algorithm for generating these partitions, new identities for additive partitions and the Riemann zeta function are also produced.
متن کاملArithmagons and Geometrically Invariant Multiplicative Integer Partitions
In this article, we introduce a formal definition for integral arithmagons. Informally, an integral arithmagon is a polygonal figure with integer labeled vertices and edges in which, under a binary operation, adjacent vertices equal the included edge. By considering the group of automorphisms for the associated graph, we count the number of integral arithmagons whose exterior sum or product equ...
متن کاملMultiperson Decision Making Based on Multiplicative Preference Relations Multiperson Decision Making Based on Multiplicative Preference Relations
A multiperson decision making problem, where the information about the alternatives provided by the experts can be presented by means of diierent preference representation structures (preference orderings, utility functions and multiplicative preference relations) is studied. Assuming the multiplicative preference relation as the uniform element of the preference representation, a multiplicativ...
متن کاملA Quadratic Programming Method for Ranking Alternatives Based on Multiplicative and Fuzzy Preference Relations
This paper proposes a quadratic programming method (QPM) for ranking alternatives based on multiplicative preference relations (MPRs) and fuzzy preference relations (FPRs). The proposed QPM can be used for deriving a ranking from either a MPR or a FPR, or a group of MPRs, or a group of FPRs, or their mixtures. The proposed approach is tested and examined with two numerical examples, and compara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2023
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2022.102481